| Richard Statman | |
|---|---|
| Born | Sept 6, 1946 |
| Fields | computer science |
| Institutions | Carnegie Mellon |
| Alma mater | Stanford University |
| Doctoral advisor | Georg Kreisel |
| Doctoral students | Enrico Tronci |
Richard Statman is an American computer scientist whose principal research interest is the theory of computation, especially symbolic computation. His research involves lambda calculus, type theory and combinatory algebra.
In 1974, Statman received his Ph.D. from Stanford University for his Ph.D dissertation, supervised by Georg Kreisel, entitled Structural Complexity of Proofs. His achievements include the proof that type inhabitation problem problem in simply typed lambda calculus is PSPACE-complete.